PENENTUAN RUTE PENGIRIMAN ES BATU MENGGUNAKAN NEAREST NEIGHBOR DAN EXCEL SOLVER
نویسندگان
چکیده
Permasalahan yang sering dijumpai dalam optimasi pengiriman sebuah produk adalah Travelling Salesman Problem (TSP). TSP merupakan masalah pencarian rute terpendek dari sejumlah node, di satu kali perjalanan. Perusahaan Es Batu melakukan menginginkan terpendek, untuk mengurangi keterlambatan pengiriman. Dampak terhadap kualitas es batu dapat menurunkan kepuasan pelanggan. Rute tidak diatur akan berpengaruh tingginya biaya transportasi dikeluarkan oleh perusahaan. saat ini belum menggunakan metode tertentu menentukan Penelitian penentuan dengan membandingkan algoritma nearest neighbor dan bantuan Excel Solver. Penentuan neighbor, dipatkan hasil yaitu 40.72 km sedangan software Solver mendapatkan 36.52 km. bahwa mempersingkat perjalanan sebesar 22% sebelumnya
منابع مشابه
SNNAP: Solver-Based Nearest Neighbor for Algorithm Portfolios
The success of portfolio algorithms in competitions in the area of combinatorial problem solving, as well as in practice, has motivated interest in the development of new approaches to determine the best solver for the problem at hand. Yet, although there are a number of ways in which this decision can be made, it always relies on a rich set of features to identify and distinguish the structure...
متن کاملNearest Neighbor
Over the last decade, an immense amount of data has become available. From collections of photos, to genetic data, and to network traffic statistics, modern technologies and cheap storage have made it possible to accumulate huge datasets. But how can we effectively use all this data? The ever growing sizes of the datasets make it imperative to design new algorithms capable of sifting through th...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملNearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While a...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal Of Industrial Engineering And Technology
سال: 2023
ISSN: ['2723-4711']
DOI: https://doi.org/10.24176/jointech.v3i2.10111